Minimal Nonstandard Coxeter Trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coxeter orbits and Brauer trees

We study the cohomology with modular coefficients of Deligne-Lusztig varieties associated to Coxeter elements. Under some torsion-free assumption on the cohomology we derive several results on the principal l-block of a finite reductive group G(Fq) when the order of q modulo l is assumed to be the Coxeter number. These results include the determination of the planar embedded Brauer tree of the ...

متن کامل

Computation in Coxeter Groups Ii. Minimal Roots

In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that paper I discussed how this algorithm could be used to build the reflection table of minimal roots, which could in turn form the basis of a much more efficient...

متن کامل

Coxeter orbits and Brauer trees II

The purpose of this paper is to discuss the validity of the assumptions (W) and (S) stated in [12], about the torsion in the modular l-adic cohomology of Deligne-Lusztig varieties associated with Coxeter elements. We prove that both (W) and (S) hold except for groups of type E7 or E8.

متن کامل

Degrees in $k$-minimal label random recursive trees

This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring

متن کامل

Minimal Locked Trees

Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties needed for planar trees to lock, with a focus on finding the smallest locked trees according to different measures of complexity, and suggests some new avenues of research for the problem of algorithmic characterizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1993

ISSN: 0021-8693

DOI: 10.1006/jabr.1993.1064